The achromatic number of Kneser graphs
نویسندگان
چکیده
The achromatic number α of a graph is the largest number of colors that can be assigned to its vertices such that adjacent vertices have different color and every pair of different colors appears on the end vertices of some edge. We estimate the achromatic number of Kneser graphs K(n, k) and determine α(K(n, k)) for some values of n and k. Furthermore, we study the achromatic number of some geometric type Kneser graphs.
منابع مشابه
Symmetries of the Stable Kneser Graphs
It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...
متن کاملRandom Kneser graphs and hypergraphs
A Kneser graph KGn,k is a graph whose vertices are all k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n − 2k + 2. In this paper we discuss the chromatic number of random Kneser graphs and hypergraphs. It was studied in two recent paper...
متن کاملTwo Remarks on the Domination Number of Graphs
This paper consists of two loosely related notes on the domination number of graphs. In the first part, we provide a new upper bound for the domination number of d-regular graphs. Our bound is the best known for d ≥ 6. In the second part, we compute the exact domination number and total domination number of certain Kneser graphs, and we provide some bounds on the domination number of other Knes...
متن کاملShifts of the stable Kneser graphs and hom-idempotence
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) ...
متن کاملComplete oriented colourings and the oriented achromatic number
In this paper, we initiate the study of complete colourings of oriented graphs and the new associated notion of the oriented achromatic number of oriented and undirected graphs. In particular, we prove that for every integers a and b with 2 ≤ a ≤ b, there exists an oriented graph −→ Ga,b with oriented chromatic number a and oriented achromatic number b. We also prove that adding a vertex, delet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 54 شماره
صفحات -
تاریخ انتشار 2016